lib/Mi manual de algoritmos/version_world_finals_2009/src/template.cpp

   1 using namespace std;
   2 #include <algorithm>
   3 #include <iostream>
   4 #include <iterator>
   5 #include <sstream>
   6 #include <fstream>
   7 #include <cassert>
   8 #include <climits>
   9 #include <cstdlib>
  10 #include <cstring>
  11 #include <string>
  12 #include <cstdio>
  13 #include <vector>
  14 #include <cmath>
  15 #include <queue>
  16 #include <deque>
  17 #include <stack>
  18 #include <list>
  19 #include <map>
  20 #include <set>
  21
  22 template <class T> string toStr(const T &x)
  23 { stringstream s; s << x; return s.str(); }
  24 template <class T> int toInt(const T &x)
  25 { stringstream s; s << x; int r; s >> r; return r; }
  26
  27 #define For(i, a, b) for (int i=(a); i<(b); ++i)
  28 #define foreach(x, v) for (typeof (v).begin() x = (v).begin(); \
  29                            x != (v).end(); ++x)
  30 #define D(x) cout << #x " = " << (x) << endl
  31
  32 const double EPS = 1e-9;
  33 int cmp(double x, double y = 0, double tol = EPS){
  34     return( x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
  35 }
  36
  37 int main(){
  38
  39   return 0;
  40 }